Fast equality test for straight-line compressed strings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast equality test for straight-line compressed strings

The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.

متن کامل

Equality Testing of Compressed Strings

This paper gives a survey on efficient algorithms for checking equality of grammar-compressed strings, i.e., strings that are represented succinctly by so called straight-line programs.

متن کامل

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs

In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = uk implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. However, very little is known for testing square-freeness of a given compressed string. In this paper, we give an O(max(n2,n log2 N))-time O(n2)-spac...

متن کامل

An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Program

In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many efficient algorithms to test if a given string is square-free, have been developed so far. However, very little is known for testing square-freen...

متن کامل

Testing Square-Freeness of Strings Compressed by Balanced Straight Line Program

In this paper we study the problem of deciding whether a given compressed string contains a square. A string x is called a square if x = zz and z = u implies k = 1 and u = z. A string w is said to be square-free if no substrings of w are squares. Many efficient algorithms to test if a given string is square-free, have been developed so far. However, very little is known for testing square-freen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 2012

ISSN: 0020-0190

DOI: 10.1016/j.ipl.2012.01.008